Pattern avoidance in k-ary heaps
نویسندگان
چکیده
In this paper, we consider pattern avoidance in k-ary heaps, where the permutation associated with the heap is found by recording the nodes as they are encountered in a breadth-first search. We enumerate heaps that avoid patterns of length 3 and collections of patterns of length 3, first with binary heaps and then more generally with k-ary heaps.
منابع مشابه
Layered Heaps Beating Standard and Fibonacci Heaps in Practice
We consider the classic problem of designing heaps. Standard binary heaps run faster in practice than Fibonacci heaps but have worse time guarantees. Here we present a new type of heap that runs faster in practice than both standard binary and Fibonacci heaps, but has asymptotic insert times arbitrarily better than O(logn), namely O((logn)) for arbitrary positive integer m. Our heap is defined ...
متن کاملWilf-Equivalence on k-ary Words, Compositions, and Parking Functions
In this paper, we study pattern-avoidance in the set of words over the alphabet [k]. We say that a word w ∈ [k] contains a pattern τ ∈ [l], if w contains a subsequence order-isomorphic to τ . This notion generalizes pattern-avoidance in permutations. We determine all the Wilf-equivalence classes of word patterns of
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملDivide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
An elementary approach is given to studying the recurrence relations associated with generalized heaps (or d-heaps), cost of optimal merge, and generalized divide-and-conquer minimization problems. We derive exact formulae for the solutions of all such recurrences and give some applications. In particular, we present a precise probabilistic analysis of Floyd’s algorithm for constructing d-heaps...
متن کاملRESTRICTED 132-AVOIDING k-ARY WORDS, CHEBYSHEV POLYNOMIALS, AND CONTINUED FRACTIONS
We study generating functions for the number of n-long k-ary words that avoid both 132 and an arbitrary `-ary pattern. In several interesting cases the generating function depends only on ` and is expressed via Chebyshev polynomials of the second kind and continued fractions. 1. Extended abstract 1.1. Permutations. Let Sn denote the set of permutations of [n] = {1, 2, . . . , n}, written in one...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 64 شماره
صفحات -
تاریخ انتشار 2016